Subgradient Optimization, Generalized Programming, and Nonconvex Duality
نویسنده
چکیده
منابع مشابه
An effective optimization algorithm for locally nonconvex Lipschitz functions based on mollifier subgradients
متن کامل
Benson's algorithm for nonconvex multiobjective problems via nonsmooth Wolfe duality
In this paper, we propose an algorithm to obtain an approximation set of the (weakly) nondominated points of nonsmooth multiobjective optimization problems with equality and inequality constraints. We use an extension of the Wolfe duality to construct the separating hyperplane in Benson's outer algorithm for multiobjective programming problems with subdifferentiable functions. We also fo...
متن کاملAugmented Lagrangian Duality and Nondifferentiable Optimization Methods in Nonconvex Programming
Abstract. In this paper we present augmented Lagrangians for nonconvex minimization problems with equality constraints. We construct a dual problem with respect to the presented here Lagrangian, give the saddle point optimality conditions and obtain strong duality results. We use these results and modify the subgradient and cutting plane methods for solving the dual problem constructed. Algorit...
متن کاملOn a Modified Subgradient Algorithm for Dual Problems via Sharp Augmented Lagrangian
We study convergence properties of a modified subgradient algorithm, applied to the dual problem defined by the sharp augmented Lagrangian. The primal problem we consider is nonconvex and nondifferentiable, with equality constraints. We obtain primal and dual convergence results, as well as a condition for existence of a dual solution. Using a practical selection of the step-size parameters, we...
متن کاملInterior Epigraph Directions method for nonsmooth and nonconvex optimization via generalized augmented Lagrangian duality
We propose and study a new method, called the Interior Epigraph Directions (IED) method, for solving constrained nonsmooth and nonconvex optimization. The IED method considers the dual problem induced by a generalized augmented Lagrangian duality scheme, and obtains the primal solution by generating a sequence of iterates in the interior of the dual epigraph. First, a deflected subgradient (DSG...
متن کامل